public class sdjfi {
    public class getKtree {
        class TreeNode {
            int node;
            TreeNode left;
            TreeNode right;

            public TreeNode(int node) {
                this.node = node;
            }
        }
        TreeNode root = null;
        public int getk(TreeNode root,int k){
            if(root == null){
                return 0;
            }
            if(k==1){
                return 1;
            }
            return  getk(root.left,k-1)+
                    getk(root.right,k-1);
        }
        public static void main(String[] args) {

        }
    }

}
